Admissible Rules of Lukasiewicz Logic
نویسنده
چکیده
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).
منابع مشابه
Bases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Lukasiewicz logic has no finite basis of admissible rules.
متن کاملThe complexity of admissible rules of Lukasiewicz logic
We investigate the computational complexity of admissibility of inference rules in infinite-valued Lukasiewicz propositional logic ( L). It was shown in [13] that admissibility in L is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of L are PSPACE-complete. In contrast, derivable rules of L are known to be coNP-complete.
متن کاملA Syntactic Characterization of the Gabbay-de Jongh Logics
Skura [12] syntactically characterised intuitionistic propositional logic among all intermediate logics by means of a Lukasiewicz-style refutation system. Another such syntactic characterisation is given by Iemhoff [5] in terms of admissible rules. Here we offer a bridge between these results. That is to say, we provide sufficient conditions under which admissible rules yield a refutation syste...
متن کاملSOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC
In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.
متن کاملOn the set of intermediate logics between the truth- and degree-preserving Łukasiewicz logics
The aim of this paper is to explore the class of intermediate logics between the truth-preserving Lukasiewicz logic L and its degree-preserving companion L≤. From a syntactical point of view, we introduce some families of inference rules (that generalize the explosion rule) that are admissible in L≤ and derivable in L and we characterize the corresponding intermediate logics. From a semantical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 20 شماره
صفحات -
تاریخ انتشار 2010